Minimal and Subminimal Logic of Negation

نویسندگان

  • Almudena Colacito
  • Dick de Jongh
چکیده

Starting from the original formulation of minimal propositional logic proposed by Johansson, this thesis aims to investigate some of its relevant subsystems. The main focus is on negation, defined as a primitive unary operator in the language. Each of the subsystems considered is defined by means of some ‘axioms of negation’: different axioms enrich the negation operator with different properties. The basic logic is the one in which the negation operator has no properties at all, except the property of being functional. A Kripke semantics is developed for these subsystems, and the clause for negation is completely determined by a function between upward closed sets. Soundness and completeness with respect to this semantics are proved, both for Hilbert-style proof systems and for defined sequent calculus systems. The latter are cut-free complete proof systems and are used to prove some standard results for the logics considered (e.g., disjunction property, Craig’s interpolation theorem). An algebraic semantics for the considered systems is presented, starting from the notion of Heyting algebras without a bottom element. An algebraic completeness result is proved. By defining a notion of descriptive frame and developing a duality theory, the algebraic completeness result is transferred into a frame-based completeness result which has a more generalized form than the one with respect to Kripke semantics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Minimal Negation in the Ternary Relational Semantics

Minimal Negation is defined within the basic positive relevance logic in the relational ternary semantics: B+. Principles of weak negation are shown to be isolable, thus defining a number of subminimal negations in the B+ context. Complete ternary semantics are offered for minimal negation in B+. Certain forms of reductio are conjectured to be undefinable (in ternary frames) without extending t...

متن کامل

Gemma ROBLES , José M . MÉNDEZ and Francisco SALTO MINIMAL NEGATION IN THE TERNARY RELATIONAL SEMANTICS

A b s t r a c t. Minimal Negation is defined within the basic positive relevance logic in the relational ternary semantics: B+. Thus, by defining a number of subminimal negations in the B+ context, principles of weak negation are shown to be isolable. Complete ternary semantics are offered for minimal negation in B+. Certain forms of reductio are conjectured to be undefinable (in ternary frames...

متن کامل

Subminimal negation

Minimal Logic, i.e. intuitionistic logic without the ex falso principle, is investigated in its original form with a negation symbol instead of a symbol denoting the contradiction. A Kripke semantics is developed for minimal logic and its sublogics with a still weaker negation by introducing a function on the upward closed sets of the models. The basic logic is a logic in which the negation has...

متن کامل

Embedding negation as failure into minimal knowledge

Recent studies in nonmonotonic reasoning have shown that many of the best known nonmonotonic logics are based on the same two fundamental principles, i.e. minimal knowledge and negation as failure (or negation by default). In this paper we prove that it is possible to express negation as failure in terms of minimal knowledge. Specifically, we present a polynomial, non-faithful, modular embeddin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016